A lower bound for higher topological complexity of real projective space

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Pseudo Ricci symmetric real hypersurfaces of a complex projective space

Pseudo Ricci symmetric real hypersurfaces of a complex projective space are classified and it is proved that there are no pseudo Ricci symmetric real hypersurfaces of the complex projective space CPn for which the vector field ξ from the almost contact metric structure (φ, ξ, η, g) is a principal curvature vector field.

متن کامل

A Generic Time-Space Lower Bound for Proof Complexity

We show that for all reals c and d such that cd < 4 there exists a positive real e such that tautologies cannot be decided by both a nondeterministic algorithm that runs in time n, and a nondeterministic algorithm that runs in time n and space n. In particular, for every d < 3 √ 4 there exists a positive e such that tautologies cannot be decided by a nondeterministic algorithm that runs in time...

متن کامل

pseudo ricci symmetric real hypersurfaces of a complex projective space

pseudo ricci symmetric real hypersurfaces of a complex projective space are classified and it is proved that there are no pseudo ricci symmetric real hypersurfaces of the complex projective space cpn for which the vector field ξ from the almost contact metric structure (φ, ξ, η, g) is a principal curvature vector field.

متن کامل

A Lower Bound for Computing Lagrange's Real Root Bound

In this paper, we study a bound on the real roots of a polynomial by Lagrange. From known results in the literature, it follows that Lagrange’s bound is also a bound on the absolute positiveness of a polynomial. A simple O(n logn) algorithm described in Mehlhorn-Ray (2010) can be used to compute the bound. Our main result is that this is optimal in the real RAM model. Our paper explores the tra...

متن کامل

Symmetric Topological Complexity as the First Obstruction in Goodwillie’s Euclidean Embedding Tower for Real Projective Spaces

As a first goal, it is explained why the Goodwillie-Weiss calculus of embeddings offers new information about the Euclidean embedding dimension of Pm only for m ≤ 15. Concrete scenarios are described in these low-dimensional cases, pinpointing where to look for potential—but critical— high-order obstructions in the corresponding Taylor towers. For m ≥ 16, the relation TC(Pm) ≥ n is translated i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Pure and Applied Algebra

سال: 2018

ISSN: 0022-4049

DOI: 10.1016/j.jpaa.2017.11.003